ZZZ (working) / Graph (Bibtex)

P313:

Input:

Output:

Complexity:

Comment:

They give a general framework for generating graphs without duplication.

Reference:

[McKay1998] (Bibtex)

P261:

Input:

Output:

Complexity:

Comment:

Reference:

[Ramon2007] (Bibtex)

P221: Enumeration of all canonical embeddings of rooted graphs

Input:

Output:

All canonical embeddings of rooted graphs in a class $\mathcal{H}$ over $\mathcal{B}$.

Complexity:

$O(T(n))$ time per solution and $O(S(n) + n)$ space.

Comment:

Reference:

[Zhuang2010b] (Bibtex)